6 research outputs found

    Bender's Decomposition for Optimization Design Problems in Communication Networks

    Get PDF
    Various types of communication networks are constantly emerging to improve connectivity services and facilitate the interconnection of various types of devices. This involves the development of several technologies, such as device-to-device communications, wireless sensor networks and vehicular communications. The various services provided have heterogeneous requirements on the quality metrics such as throughput, end-to-end latency and jitter. Furthermore, different network technologies have inherently heterogeneous restrictions on resources, for example, power, interference management requirements, computational capabilities, and so on. As a result, different network operations such as spectrum management, routing, power control and offloading need to be performed differently. Mathematical optimization techniques have always been at the heart of such design problems to formulate and propose computationally efficient solution algorithms. One of the existing powerful techniques of mathematical optimization is Benders Decomposition (BD), which is the focus of this article. Here, we briefly review different BD variants that have been applied in various existing network types and different design problems. These main variants are the classical, the combinatorial, the multi-stage, and the generalized BD. We discuss compelling BD applications for various network types including heterogeneous cellular networks, infrastructure wired wide area networks, smart grids, wireless sensor networks, and wireless local area networks. Mainly, our goal is to assist the readers in refining the motivation, problem formulation, and methodology of this powerful optimization technique in the context of future networks. We also discuss the BD challenges and the prospective ways these can be addressed when applied to communication networks' design problems

    Digital RIS (DRIS) : the future of digital beam management in RIS-assisted OWC systems

    Get PDF
    Reconfigurable intelligent surfaces (RIS) have been recently introduced to optical wireless communication (OWC) networks to resolve skip areas and improve the signal-to-noise ratio at the user's end. In OWC networks, RIS are based on mirrors or metasurfaces. Metasurfaces have evolved significantly over the last few years. As a result, coding, digital, programmable, and information metamaterials have been developed. The advantage of these materials is that they can enable digital signal processing (DSP) techniques. For the first time, this paper proposes the use of digital RIS (DRIS) in OWC systems. We discuss the concept of DRIS and the application of DSP methods to the physical material. In addition, we examine metamaterials for optical DRIS with liquid crystals serving as the front row material. Finally, we present a design example and discuss future research directions

    Digital RIS (DRIS) : the future of digital beam management in RIS-assisted OWC systems

    Get PDF
    Reconfigurable intelligent surfaces (RIS) have been recently introduced to optical wireless communication (OWC) networks to resolve skip areas and improve the signal-to-noise ratio at the user's end. In OWC networks, RIS are based on mirrors or metasurfaces. Metasurfaces have evolved significantly over the last few years. As a result, coding, digital, programmable, and information metamaterials have been developed. The advantage of these materials is that they can enable digital signal processing (DSP) techniques. For the first time, this paper proposes the use of digital RIS (DRIS) in OWC systems. We discuss the concept of DRIS and the application of DSP methods to the physical material. In addition, we examine metamaterials for optical DRIS with liquid crystals serving as the front row material. Finally, we present a design example and discuss future research directions

    Effects of CSI Knowledge on Secrecy of Threshold-Selection Decode-and-Forward Relaying

    Get PDF
    This paper considers secrecy of a three node cooperative wireless system in the presence of a passive eavesdropper. The threshold-selection decode-and-forward (DF) relay is considered, which can decode the source message correctly only if a predefined signal-to-noise ratio (SNR) is achieved. The effects of channel state information (CSI) availability on secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are investigated, and closed-form expressions are derived. Diversity is achieved from the direct and relaying paths both at the destination and at the eavesdropper by combinations of maximal-ratio combining (MRC) and selection combining (SC) schemes. An asymptotic analysis is provided when each hop SNR is the same in the balanced case and when it is different in the unbalanced case. The analysis shows that both hops can be a bottleneck for secure communication; however, they do not affect the secrecy identically. While it is observed that CSI knowledge can improve secrecy, the amount of improvement for SOP is more when the required rate is low and for ESR when the operating SNR is also low. It is also shown that the source to eavesdropper link SNR is more crucial for secure communication.Comment: 16 pages, 7 figure

    Multiple-votes parallel symbol-flipping algorithm for non-binary LDPC codes

    No full text
    International audienceA novel decoding algorith for non-binary low density parity check (NB-LDPC) codes is proposed. The algorithm builds on the recently designed parallel symbol-flipping decoding (PSFD) algorithm and combines a technique of error estimation and a method of multiple voting levels from each unsatisfied check-sum to the corresponding variable nodes. Simulations results, performed on a number of NB-LDPC codes of various lengths and column weights constructed using several methods, show that the new algorithm not only avoids using code-dependent voting threshold but also improves the error rate performance of the PSFD algorithm, particularly for low column weight parity-check matrices

    On Bounds for the Cognitive Multiple Access Z-Interference Channel

    No full text
    The Cognitive Multiple Access Z-Interference Channel consists of a MAC channel that receives interference from an external transmitter. In a previous work we studied this model where both MAC users are cognitive and showed that an encoding scheme based on Dirty Paper coding attains the capacity region for the Gaussian case. In this work we assume that only one MAC user is cognitive and show that the non-cognitive MAC user can still benefit from the cognition of the other MAC user compared to the case where none of the MAC users are cognitive. We compare the achievable rate region obtained for our model with those for the cases where interference is treated as noise and where part of the primary user's message is decodable at the MAC receiver
    corecore